\section{Conclusion and Future Work}
\vspace{-0.5em}
Because of the increasing demand for the bandwidth and the multimedia application in mobile communication systems, the embedded system has to provide more processing power. Therefore, the multi-core system is the future of the embedded system. This thesis introduces a new dynamic-priority scheduling technique (DSPD) which is suitable for the multi-core system. This scheduling technique is based on max-plus algebra and extended regarding priority control. Compared to the traditional dynamic-priority scheduling technique (DSWC), DSPD is able to reduce the average response time of tasks or threads with the higher priority and improves the utilization of the resource of the chip. Based on a DSE framework, we did the comparison between DSWC and DSPD. In the experiment, DSPD decreases the average response time of threads in some situations.

The more experiments should be done to test DSPD scheduling in the different situations in the future, so more  larger task graphs and cores in the benchmark will be used. Now the transfer latency is fixed in the framework, it can be changed to be non-deterministic latencies to meet the requirements in the different kinds of embedded systems in the future work, such as due to the best effort routing in network-on-chip. Currently we give the higher priority to the threads with shorter period. In the future, we can shift to new methods, e.g. we give the higher priority to the threads with bigger difference between the worst case deadline and the best case deadline.











